Frustration and overblocking on graphs
نویسندگان
چکیده
منابع مشابه
Frustration with Fat Graphs
We consider the effect of geometric frustration induced by the random distribution of loop lengths in the “fat” graphs of the dynamical triangulations model on coupled antiferromagnets. While the influence of such connectivity disorder is rather mild for ferromagnets in that an ordered phase persists and only the properties of the phase transition are substantially changed in some cases, any fi...
متن کاملOn the bipartite vertex frustration of graphs
The bipartite vertex (resp. edge) frustration of a graph G, denoted by ψ(G) (resp. φ(G)), is the smallest number of vertices (resp. edges) that have to be deleted from G to obtain a bipartite subgraph of G. A sharp lower bound of the bipartite vertex frustration of the line graph L(G) of every graph G is given. In addition, the exact value of ψ(L(G)) is calculated when G is a forest.
متن کاملEntanglement frustration for Gaussian states on symmetric graphs.
We investigate the entanglement properties of multimode Gaussian states, which have some symmetry with respect to the ordering of the modes. We show how the symmetry constrains the entanglement between two modes of the system. In particular, we determine the maximal entanglement of formation that can be achieved in symmetric graphs like chains, 2D and 3D lattices, mean field models and the plat...
متن کاملMaximum Frustration in Bipartite Signed Graphs
A signed graph is a graph where each edge is labeled as either positive or negative. A circle is positive if the product of edge labels is positive. The frustration index is the least number of edges that need to be removed so that every remaining circle is positive. The maximum frustration of a graph is the maximum frustration index over all possible sign labellings. We prove two results about...
متن کاملThe bipartite edge frustration of composite graphs
The smallest number of edges that have to be deleted from a graph to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by φ(G). In this paper we determine the bipartite edge frustration of some classes of composite graphs. © 2010 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1997
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(97)00212-4